The Stone Representation Theorem for Boolean Algebras
نویسنده
چکیده
The Stone Representation Theorem for Boolean Algebras, first proved by M. H. Stone in 1936 ([4]), states that every Boolean algebra is isomorphic to a field of sets. This paper motivates and presents a proof.
منابع مشابه
Dually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملStone duality for nominal Boolean algebras with ‘new’: topologising Banonas
We define Boolean algebras over nominal sets with a functionsymbol Nmirroring the N‘fresh name’ quantifier. We also define dual notions of nominal topology and Stone space, prove a representation theorem over fields of nominal sets, and extend this to a Stone duality.
متن کاملBoolean Algebras and Distributive Lattices Treated Constructively
Some aspects of the theory of Boolean algebras and distributive lattices -in particular, the Stone Representation Theorems and the properties of filters and ideals -are analyzed in a constructive setting.
متن کاملA Representation Theorem for System P
We prove a representation theorem for non-monotonic inference relations that are defined over elements of some Boolean algebras and obey the rules of System P. An inference relation is represented by a closure operator on the Stone space of the Boolean algebra. This representation theorem generalizes and gives new insights into existing completeness theorems for System P. Let A be a Boolean alg...
متن کامل